Reversible Space Equals Deterministic Space
نویسندگان
چکیده
منابع مشابه
Reversible Space Equals Deterministic Space
This paper describes the simulation of an S(n) spacebounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by Bennett in 1989 and refutes the conjecture, made by Li and Vitanyi in 1996, that any reversible simulation of an irreversible computation must obey Bennett’s reversible pebble game rules.
متن کاملSpace-Efficient Reversible Simulations
We study constructions that convert arbitrary deterministic Turing machines to reversible machines; i.e. reversible simulations. Specifically, we study space-efficient simulations; that is, the resulting reversible machine uses O(f(S)) space, where S is the space usage of the original machine and f is very close to linear (say, n log n or smaller). We generalize the previous results on this rev...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملSpace-Efficient Deterministic Simulation of Probabilistic Automata
Given a description of a probabilistic automaton (one-head probabilistic nite automaton or probabilistic Turing machine) and an input string x of length n, we ask how much space does a deterministic Turing machine need in order to decide the acceptance of the input string by that automaton? The question is interesting even in the case of one-head one-way probabilistic nite automata (PFA). We ca...
متن کاملDeterministic Amplification of Space-Bounded Probabilistic Algorithms
This paper initiates the study of deterministic amplification of space-bounded probabilistic algorithms. The straightforward implementations of known amplification methods cannot be used for such algorithms, since they consume too much space. We present a new implementation of the Ajtai-Komlós-Szemerédi method, that enables to amplify an S-space algorithm that uses r random bits and errs with p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2000
ISSN: 0022-0000
DOI: 10.1006/jcss.1999.1672